Hyperbolic Regular Polygons with Notched Edges
نویسنده
چکیده
In this article we solve the tiling problem for hyperbolic and Euclidean regular polygons whose edges are notched with matching bumps and nicks.
منابع مشابه
On the behavior of growth of polygons in semi-regular hyperbolic tessellations
In this work we consider tessellations (or tilings) of the hyperbolic plane by copies of a semi-regular polygon with alternating angles and we study the behavior of the growth of the polygons, edges, and vertices when the distance increase from a fixed initial polygon. Subjects: Science; Mathematics & Statistics; Advanced Mathematics; Geometry
متن کاملEnumeration of Vertices, Edges and Polygons in Tessellations of the Plane
In this work, we consider the tessellations (or tilings) of Euclidean and hyperbolic planes using copies of a regular polygon. We introduce the concept of k-type of vertices and edges, which allow a thorough control of these elements when the tessellation increases, and we obtain an enumeration for the vertices, edges, and polygons at a given distance. Partially funded by a grant from Fapesp (2...
متن کاملSmall deformations of polygons and polyhedra
We describe the first-order variations of the angles of Euclidean, spherical or hyperbolic polygons under infinitesimal deformations such that the lengths of the edges do not change. Using this description, we introduce a quadratic invariant on the space of first-order deformations of a polygon. For convex polygons, this quadratic invariant has a positivity property, leading to a new proof of t...
متن کاملWhere to build a temple, and where to dig to find one
In this paper, we analyze the time complexity of finding regular polygons in a set of n points. We use two different approaches to find regular polygons, depending on their number of edges. Those with o(n) edges are found by sweeping a line through the set of points, while the larger polygons are found by random sampling. We can find all the polygons with high probability in O(n ) expected time...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 34 شماره
صفحات -
تاریخ انتشار 2005